Zero-nonzero Patterns for Nilpotent Matrices over Finite Fields
نویسنده
چکیده
Abstract. Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which zero-nonzero patterns are potentially nilpotent over F, with a special emphasis on the case that F = Zp is a finite field. As part of this investigation, we develop methods, using the tools of algebraic geometry and commutative algebra, to eliminate zero-nonzero patterns A as being potentially nilpotent over any field F. We then use these techniques to classify all irreducible zero-nonzero patterns of order two and three that are potentially nilpotent over Zp for each prime p.
منابع مشابه
Ela Zero-nonzero Patterns for Nilpotent Matrices Over
Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper an investigation is initiated into which zero-nonzero patterns are potentially nilpotent over F with a special emphasis on the case that F = Zp is a finite field. A necessary condition on F is observed for...
متن کاملStructure of nilpotent matrices over fields
A zero-nonzero pattern A is said to be potentially nilpotent over a field F if there exists a nilpotent matrix with entries in F having zero-nonzero pattern A. We explore the construction of potentially nilpotent patterns over a field. We present classes of patterns which are potentially nilpotent over a field F if and only if the field F contains certain roots of unity. We then introduce some ...
متن کاملAn upper bound for the minimum rank of a graph
For a graph G of order n, the minimum rank of G is defined to be the smallest possible rank over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. We prove an upper bound for minimum rank in terms of minimum degree of a vertex is valid for many graphs, including all bipartite graphs, and conjecture this bound ...
متن کاملInvertible and Nilpotent Matrices over Antirings
Abstract. In this paper we characterize invertible matrices over an arbitrary commutative antiring S with 1 and find the structure of GLn(S). We find the number of nilpotent matrices over an entire commutative finite antiring. We prove that every nilpotent n×n matrix over an entire antiring can be written as a sum of ⌈log2 n⌉ square-zero matrices and also find the necessary number of square-zer...
متن کاملHow Much Does a Matrix of Rank k Weigh?
Matrices with very few nonzero entries cannot have large rank. On the other hand matrices without any zero entries can have rank as low as 1. These simple observations lead us to our main question. For matrices over finite fields, what is the relationship between the rank of a matrix and the number of nonzero entries in the matrix? This question motivated a summer research project collaboration...
متن کامل